Fast simulation of retrial queues
نویسنده
چکیده
This paper describes a discrete-time retrial queue and shows how importance sampling simulations can be applied for estimating the probability of large orbit content and the overflow fraction of primary calls.
منابع مشابه
Retrial queues with limited number of retrials : Numerical Investigations
Retrial queues are frequently observed in a real world system likewise call center or internet service industries. In this paper, a retrial queue system in which the number of retrials of each customer is limited by a finite number, say m is considered. That is, if a customer fails to enter the service facility at mth retrial, then the customer leaves the system without service. The effects of ...
متن کاملUnreliable bulk retrial queues with delayed repairs and modified vacation policy
The present investigation deals with the bulk arrival M/G/1 retrial queue with impatient customers and modified vacation policy. The incoming customers join the virtual pool of customers called orbit if they find the server being busy, on vacation or in broken down state otherwise the service of the customer at the head of the batch is started by the server. The service is provided in k</em...
متن کاملBernoulli Vacation Policy for a Bulk Retrial Queue with Fuzzy Parameters
In this paper, we investigate the fuzzy logic based system characteristics of MX/G/1 retrial queuing system with Bernoulli vacation schedule. The service time and vacation time are assumed to be generally distributed. It is found in many practical situations that the queuing models with fuzzy parameters are much more realistic than the classical crisp parameters based queuing models. We have...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملStandard and Retrial Queueing Systems: a Comparative Analysis
We describe main models and results of a new branch of the queueing theory, theory of retrial queues, which is characterized by the following basic assumption: a customer who cannot get service (due to finite capacity of the system, balking, impatience, etc.) leaves the service area, but after some random delay returns to the system again. Emphasis is done on comparison with standard queues wit...
متن کامل